On ordering strategies in a multigrid algorithm
نویسنده
چکیده
منابع مشابه
Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملAnalysis of a new Red-Black Ordering for Gauss-Seidel Smoothing in Cell-Centred Multigrid
Based on numerical experiments with a cell-centred multigrid Poisson solver in one and two dimensions, we propose to use Alternating Coarse-Line Zebra ordering as a robust parallel smoother for the 2D case. The algorithm is presented based on a heuristic discussion, and the convergence rates obtained with diierent smoothers are compared. Local mode analysis is used to estimate the smoothing fac...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملFourier Analysis of Multigrid Methods on Hexagonal Grids
This paper applies local Fourier analysis to multigrid methods on hexagonal grids. Using oblique coordinates to express the grids and a dual basis for the Fourier modes, the analysis proceeds essentially the same as for rectangular grids. The framework for oneand two-grid analyses is given and then applied to analyze the performance of multigrid methods for the Poisson problem on a hexagonal gr...
متن کاملA new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming
Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997